Mandala Networks: ultra-robust, ultra-small-world and highly sparse graphs
نویسندگان
چکیده
C. I. N. Sampaio Filho, A. A. Moreira, R. F. S. Andrade, H. J. Herrmann, J. S. Andrade Jr. Departamento de F́ısica, Universidade Federal do Ceará, 60451-970 Fortaleza, Ceará, Brazil 2 Instituto de F́ısica, Universidade Federal da Bahia, 40210-340 Salvador, Bahia, Brazil 3 Computational Physics for Engineering Materials, IfB, ETH Zurich, Schafmattstrasse 6, 8093 Zurich, Switzerland (Dated: April 16, 2014)
منابع مشابه
Mandala Networks: ultra-small-world and highly sparse graphs
The increasing demands in security and reliability of infrastructures call for the optimal design of their embedded complex networks topologies. The following question then arises: what is the optimal layout to fulfill best all the demands? Here we present a general solution for this problem with scale-free networks, like the Internet and airline networks. Precisely, we disclose a way to system...
متن کاملOn the Fundamental Characteristics of Ultra-Dense Small Cell Networks
In order to cope with the forecasted 1000× increase in wireless capacity demands by 2030, network operators will aggressively densify their network infrastructure to reuse the spectrum as much as possible. However, it is important to realise that these new ultra-dense small cell networks are fundamentally different from the traditional macrocell or sparse small cell networks, and thus ultra-den...
متن کاملTowards Scalable Spectral Clustering via Spectrum-Preserving Sparsification
The eigendeomposition of nearest-neighbor (NN) graph Laplacian matrices is the main computational bottleneck in spectral clustering. In this work, we introduce a highly-scalable, spectrum-preserving graph sparsification algorithm that enables to build ultra-sparse NN (u-NN) graphs with guaranteed preservation of the original graph spectrums, such as the first few eigenvectors of the original gr...
متن کاملSimilarity-Aware Spectral Sparsification by Edge Filtering
In recent years, spectral graph sparsification techniques that can compute ultra-sparse graph proxies have been extensively studied for accelerating various numerical and graphrelated applications. Prior nearly-linear-time spectral sparsification methods first extract low-stretch spanning tree from the original graph to form the backbone of the sparsifier, and then recover small portions of spe...
متن کاملModels of Sparse Random Graphs and Network Algorithms
There is no doubt now that the current trend that every electronic device should be connected in one way or another (usually many) implies a greater need for efficient networks. These networks should be connected, exhibit small-world behavior and their topology should be robust to local modifications like device movement; all this should be achieved using minimal and distributed processes. The ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1406.7259 شماره
صفحات -
تاریخ انتشار 2014